منابع مشابه
Pattern Graph Rewrite Systems
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the po...
متن کاملGraph Rewrite Systems for Software Design Transformations
Middleware has become an important part in business applications. Different middleware platforms require different software designs. Even version changes of the used platform often lead to complex re-designs of software. Furthermore, complex business and platform-specific knowledge is required, to translate abstract business models to platform specific implementations. This paper presents the s...
متن کاملModeling DNA Nanodevices Using Graph Rewrite Systems
DNA based nanostructures and devices are becoming ubiquitous in nanotechnology with rapid advancements in theory and experiments in DNA self-assembly which have led to a myriad of DNA nanodevices. However, the modeling methods used by researchers in the field for design and analysis of DNA nanostructures and nanodevices have not progressed at the same rate. Specifically, there does not exist a ...
متن کاملGraph Rewrite Systems For Program Optimization
In this paper we demonstrate how graph rewrite systems can be used to specify and generate program optimizations. For termination of the systems we develop several rule-based criteria, deening exhaustive graph rewrite systems. For non-deterministic systems we introduce stratii-cation which automatically selects single normal forms. To illustrate how far the methodology reaches, we specify parts...
متن کاملGraph Rewrite Systems for Classical Structures in †-Symmetric Monoidal Categories
This paper introduces several related graph rewrite systems derived from known identities on classical structures within a †-symmetric monoidal category. First, we develop a rewrite system based on a single classical structure, and use it to develop a proof of the so-called “spider-theorem,” where a connected graph containing a single classical structure can be uniquely determined by the number...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2014
ISSN: 2075-2180
DOI: 10.4204/eptcs.143.5